Reconstruction of jointly sparse vectors via manifold optimization
نویسندگان
چکیده
منابع مشابه
Decentralized jointly sparse optimization
A set of vectors (or signals) are jointly sparse if all their nonzero entries are found on a small number of rows (or columns). Consider a network of agents that collaboratively recover a set of jointly sparse vectors from their linear measurements . Assume that every agent collects its own measurement and aims to recover its own vector taking advantages of the joint sparsity structure. This pa...
متن کاملEfficient Recovery of Jointly Sparse Vectors
We consider the reconstruction of sparse signals in the multiple measurement vector (MMV) model, in which the signal, represented as a matrix, consists of a set of jointly sparse vectors. MMV is an extension of the single measurement vector (SMV) model employed in standard compressive sensing (CS). Recent theoretical studies focus on the convex relaxation of the MMV problem based on the (2, 1)-...
متن کاملJointly Sparse Vector Recovery via Reweighted
An iterative reweighted algorithm is proposed for the recovery of jointly sparse vectors from multiple-measurement vectors (MMV). The proposed MMV algorithm is an extension of the iterative reweighted 1 algorithm for single measurement problems. The proposed algorithm (M-IRL1) is demonstrated to outperform non-reweighted MMV algorithms under noiseless measurements. A regularization of the M-IRL...
متن کاملSparse Randomized Kaczmarz for Support Recovery of Jointly Sparse Corrupted Multiple Measurement Vectors
While single measurement vector (SMV) models have been widely studied in signal processing, there is a surging interest in addressing the multiple measurement vectors (MMV) problem. In the MMV setting, more than one measurement vector is available and the multiple signals to be recovered share some commonalities such as a common support. Applications in which MMV is a naturally occurring phenom...
متن کاملParametric Manifold Learning Via Sparse Multidimensional Scaling
We propose a metric-learning framework for computing distance-preserving maps that generate low-dimensional embeddings for a certain class of manifolds. We employ Siamese networks to solve the problem of least squares multidimensional scaling for generating mappings that preserve geodesic distances on the manifold. In contrast to previous parametric manifold learning methods we show a substanti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Numerical Mathematics
سال: 2019
ISSN: 0168-9274
DOI: 10.1016/j.apnum.2019.05.022